Computing Connected Dominated Sets with Multipoint Relays

Multipoint relays o er an optimized way of ooding packets in a radio network. However, this technique requires the last hop knowledge: to decide wether or not a ooding packet is retransmitted, a node needs to know from which node the packet was received. When considering broadcasting at IP level, this information may be di cult to obtain. We thus propose a scheme for computing an optimized connected dominating set frommultipoint relays. This set allows to e ciently broadcast packets without the last hop information with performances close to multipoint relay ooding. Key-words: multipoint relays, connected dominating set, ad hoc network inria Rocquencourt, Domaine de Voluceau, 78153 Le Chesnay, France, {Cedric.Adjih, Philippe.Jacquet, Laurent.Viennot}@inria.fr Calcul d'ensemble dominants connexes par les relais multipoints Résumé : Ce papier présente un algorithme pour calculer un ensemble dominant connexe d'un graphe à partir d'ensembles de relais multipoint. Cet ensemble peut être utilisé pour di user e cacement une information à tous les n÷uds d'un réseau radio. Mots-clés : relais multipoint, di usion, réseau ad-hoc, ensemble connexe dominant Computing connected dominated sets with MPRs 3